Parallelism and concurrency of graph manipulations
نویسندگان
چکیده
منابع مشابه
Parallelism and Concurrency of Stochastic Graph Transformations
Graph transformation systems (GTS) have been proposed for high-level stochastic modelling of dynamic systems and networks. The resulting systems can be described as semi-Markov processes with graphs as states and transformations as transitions. The operational semantics of such processes can be explored through stochastic simulation. In this paper, we develop the basic theory of stochastic grap...
متن کاملParallelism Via Concurrency at Multiple Levels
In this paper we examine the key elements determining the best performance of computing by increasing the frequency of a single chip, and to get the minimum latency during execution of the programs to achieve best possible output. It’s not enough to provide concurrent improvements in the HDW as Software also have to introduce concurrency in order to exploit the parallelism. The software paralle...
متن کاملHandling Parallelism in a Concurrency Model
Programming models for concurrency are optimized for dealing with nondeterminism, for example to handle asynchronously arriving events. To shield the developer from data race errors effectively, such models may prevent shared access to data altogether. However, this restriction also makes them unsuitable for applications that require data parallelism. We present a library-based approach for per...
متن کاملdynamic coloring of graph
در این پایان نامه رنگ آمیزی دینامیکی یک گراف را بیان و مطالعه می کنیم. یک –kرنگ آمیزی سره ی رأسی گراف g را رنگ آمیزی دینامیکی می نامند اگر در همسایه های هر رأس v?v(g) با درجه ی حداقل 2، حداقل 2 رنگ متفاوت ظاهر شوند. کوچکترین عدد صحیح k، به طوری که g دارای –kرنگ آمیزی دینامیکی باشد را عدد رنگی دینامیکی g می نامند و آنرا با نماد ?_2 (g) نمایش می دهند. مونت گمری حدس زده است که تمام گراف های منتظم ...
15 صفحه اولConcurrency and Parallelism as a Medium for Computer Science Concepts
This paper argues that the integration of concurrency and parallelism topics throughout the computer science curriculum need not require a significant reduction in coverage of more “standard” topics. This is accomplished by recognizing that concurrency and parallelism can be used as a medium for learning about other standard topics, rather than as an additional topic to cover. This paper argues...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1980
ISSN: 0304-3975
DOI: 10.1016/0304-3975(80)90016-x